Relative Difference Sets Partitioned by Cosets

نویسندگان

  • Peter Dukes
  • Alan C. H. Ling
چکیده

We explore classical (relative) difference sets intersected with the cosets of a subgroup of small index. The intersection sizes are governed by quadratic Diophantine equations. Developing the intersections in the subgroup yields an interesting class of group divisible designs. From this and the Bose-Shrikhande-Parker construction, we obtain some new sets of mutually orthogonal latin squares. We also briefly consider optical orthogonal codes and difference triangle systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coset Intersection Graphs for Groups

Let H,K be subgroups of G. We investigate the intersection properties of left and right cosets of these subgroups. If H and K are subgroups of G, then G can be partitioned as the disjoint union of all left cosets of H, as well as the disjoint union of all right cosets of K. But how do these two partitions of G intersect each other? Definition 1. Let G be a group, and H a subgroup of G. A left t...

متن کامل

A construction for modified generalized Hadamard matrices using QGH matrices

Let G be a group of order mu and U a normal subgroup of G of order u. Let G/U = {U1, U2, · · · , Um} be the set of cosets of U in G. We say a matrix H = [hij ] order k with entries from G is a quasi-generalized Hadamard matrix with respect to the cosets G/U if ∑ 1≤t≤k hith −1 jt = λij1U1 + · · · + λijmUm (∃λij1, · · · , ∃λijm ∈ Z) for any i ̸= j. On the other hand, in our previous article we def...

متن کامل

The Diameter of the Rubik's Cube Group Is Twenty

We give an expository account of our computational proof that every position of Rubik’s Cube can be solved in 20 moves or less, where a move is defined as any twist of any face. The roughly 4.3 × 1019 positions are partitioned into about two billion cosets of a specially chosen subgroup, and the count of cosets required to be treated is reduced by considering symmetry. The reduced space is sear...

متن کامل

Enumeration of Double Cosets

Let H and K be subgroups of a group G. The double cosets of H and K in G are the sets HgK, g E G. In this paper we describe a procedure, P, for determining the cardinality of the set H\G/K of double cosets of H and K in G given a finite presentation for G and finite sets of generators for H and K. It is well known that the problem of determining whether or not a group G defined by a finite pres...

متن کامل

Cyclic Relative Difference Sets and their p-Ranks

By modifying the constructions in [10] and [15], we construct a family of cyclic ((q − 1)/(q− 1), q− 1, q3k−1, q3k−2) relative difference sets, where q = 3. These relative difference sets are “liftings” of the difference sets constructed in [10] and [15]. In order to demonstrate that these relative difference sets are in general new, we compute pranks of the classical relative difference sets a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017